#include <iostream>
using namespace std;
struct ListNode
{
    int val;
    ListNode* next;
    ListNode() : val(0), next(NULL) {}
    ListNode(int x) : val(x), next(NULL) {}
    ListNode(int x, ListNode* next) : val(x), next(next) {}
};
class Solution {
public:
    int middleNode(ListNode* head) {
        auto s = head, f = head;
        while (f && f->next) {
            f = f->next->next;
            s = s->next;
        }
        return s->val;
    }
};

ListNode* createByTail()
{
    ListNode* head;
    ListNode* p1, * p2{};
    int n = 0, num;
    int len;
    cin >> len;
    head = NULL;
    while (n < len && cin >> num)
    {
        p1 = new ListNode(num);
        n = n + 1;
        if (n == 1)
            head = p1;
        else
            p2->next = p1;
        p2 = p1;
    }
    return head;
}

int main()
{
    ListNode* head = createByTail();
    int result = Solution().middleNode(head);
    cout << result << endl;
    return 0;
}